Automatic design of algorithms for the traveling salesman problem
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for the Traveling Salesman Problem
This paper is a survey of genetic algorithms for t h e traveling salesman problem. Genetic algorithms are randomized search techniques that simulate some of the processes observed i n natural evolution. In this paper, a simple genetic algorithm is introduced, and various extensions are presented to solve t h e traveling salesman problem. Computational results are also repor ted for both random ...
متن کاملApproximation algorithms for the traveling salesman problem
We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable under an approximation measure, called differential-approximation ratio, that measures how the value of an approximate solution is placed in the in...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cogent Engineering
سال: 2016
ISSN: 2331-1916
DOI: 10.1080/23311916.2016.1255165